D-ARM: A New Proposal for Multi-Dimesional Interconnection Networks
نویسندگان
چکیده
منابع مشابه
Performance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...
متن کاملPerformance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...
متن کاملNew Interconnection Networks: a Survey
Interconnection plays a vital role in Massively Parallel Processing (MPP) system by providing communication among active processing elements. Several interconnection networks have been proposed in literature, however, a very few have been implemented in reality due to various issues such as scalability, latency, communication locality etc. In recent year several new interconnection networks bei...
متن کاملA New Proposal for QKD Relay Networks
A simple technique to secure quantum key distribution relay networks is presented here. The paper introduces the concept of logical channels that uses a random dropout scheme. The paper also presents an enhanced protocol for key distribution in the relay networks. Previous techniques relied on creating distinct physical paths to create shares. Hence the compromise of one relay must compromise t...
متن کاملA New Property of Interconnection Networks
A graph G is pancyclic if G includes cycles of all lengths and G is edge-pancyclic if each edge lies on cycles of all lengths. A bipartite graph is edge-bipancyclic if each edge lies on cycles of every even length from 4 to |V (G)|. Two cycles with the same length m, C1 = ⟨u1, u2, · · · , um, u1⟩ and C2 = ⟨v1, v2, · · · , vm, v1⟩ passing through an edge (x, y) are independent with respect to th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Communication and Information Systems
سال: 1999
ISSN: 1980-6604
DOI: 10.14209/jcis.1999.9